Sorting and Selecting in Rounds

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sorting and Selecting in Rounds

We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being "explicit modulo expansion"; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and s...

متن کامل

Sorting and Selecting in Totally Monotone

An mn matrix A is called totally monotone if for all i1 < i2 and j1 < j2, Ai1; j1] > Ai1; j2] implies Ai2; j1] > Ai2; j2]. We consider the complexity of comparison-based selection and sorting algorithms in such matrices. Although our selection algorithm counts only comparisons its advantage on all previous work is that it can also handle selection of elements of diierent (and arbitrary) ranks i...

متن کامل

Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory

Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs are proved using the eigenvalues of their adjacency matrices. These graphs enable us to improve ...

متن کامل

Sorting in Few Rounds on the Broadcast Communication Model

The main contribution of this work is to present a simple, fast ranking and sorting algorithms in the broadcast communication model (BCM, for short). At the heart of our algorithm is a new and elegant sampling and bucketing scheme. The main feature of our sampling scheme is that the resulting buckets are well balanced, making costly rebalancing unnecessary. The resulting algorithm uses only 2 n...

متن کامل

An efficient method for sorting and selecting for social behaviour

1. In social contexts, animal behaviour is often studied in terms of group-level characteristics. One clear example of this is the collective motion of animals in decentralised structures, such as bird flocks and fish schools. A major goal of research is to identify how group-level behaviours are shaped by the traits of individuals within them. Few methods exist to make these connections. Indiv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Computing

سال: 1987

ISSN: 0097-5397,1095-7111

DOI: 10.1137/0216066